منابع مشابه
SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کاملConcerning the achromatic number of graphs
The achromatic number of a graph G is the largest number of colors that can be assigned to the vertices of G so that (i) adjacent vertices are assigned different colors, and (ii) any two different colors are assigned to some pair of adjacent vertices. We study the achromatic number from the point of view of computational complexity. We show that, for each fixed integer n, there is an algorithm ...
متن کاملThe achromatic number of Kneser graphs
The achromatic number α of a graph is the largest number of colors that can be assigned to its vertices such that adjacent vertices have different color and every pair of different colors appears on the end vertices of some edge. We estimate the achromatic number of Kneser graphs K(n, k) and determine α(K(n, k)) for some values of n and k. Furthermore, we study the achromatic number of some geo...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملAn Improved Approximation of the Achromatic Number on Bipartite Graphs
The achromatic number of a graph G = (V,E) with | V |= n vertices is the largest number k with the following property: the vertices of G can be partitioned into k independent subsets {Vi}1≤i≤k such that for every distinct pair of subsets Vi, Vj in the partition, there is at least one edge in E that connects these subsets. We describe a greedy algorithm that computes the achromatic number of a b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.01.006